The Structure of Strategy-Proof Social Choice Part II: Non-Dictatorship, Anonymity and Neutrality*
نویسنده
چکیده
Domains of generalized single-peaked preferences are classified in terms of the extent to which they enable well-behaved strategy-proof social choice. Generalizing the Gibbard-Satterthwaite Theorem, we characterize the domains that admit non-dictatorial strategy-proof social choice functions. We also provide characterizations of the domains that enable locally non-dictatorial, anonymous, and neutral strategy-proof social choice rules, respectively. Our findings imply that all domains that enable possibility results share a fundamentally similar geometry. JEL Classification D71, C72
منابع مشابه
Pairwise partition graphs and strategy-proof social choice in the exogenous indifference class model
In this paper we consider the exogenous indifference classes model of Barberá and Ehlers (2011) and Sato (2009) and analyze further the relationship between the structure of indifference classes across agents and dictatorship results. The key to our approach is the pairwise partition graph. We provide necessary conditions on these graphs for strategy-proofness and unanimity (or efficiency) to i...
متن کاملArithmetic Social Choice: Arrow’s Theorem and Single Peaked Preference
We construct an algebraic model of the social choice theory. First we give an arithmetic proof of Arrow’s Impossibility Theorem. Next we apply our algebraic method to single-peaked preference domain to establish two theorems. (i) A value of Arrovian social welfare function on single peaked preference domain is single-plateaued with at most two maximal elements. (ii) An ordering by majority voti...
متن کاملProgramming social choice in logic: some basic experimental results when profiles are restricted
Social choice theory argues mathematical models and their logical consequences for group decision making based on individuals’ preference orderings axiomatically. The most basic results have been proved in this field are two impossibility results for group decision making. Arrow’s general (im)possibility theorem for preference aggregation procedures, i.e., there is no nondictatorial social welf...
متن کاملImpossibilities for probabilistic assignment
We consider the problem of assigning objects probabilistically among a group of agents who may have multi-unit demands. Each agent has linear preferences over the (set of) objects. The most commonly used extension of preferences to compare probabilistic assignments is by means of stochastic dominance, which leads to corresponding notions of envy-freeness, efficiency, and strategy-proofness. We ...
متن کاملStrategy-proof social choice with exogenous indifference classes
There are many situations where the indifference classes of the agents’ preferences are exogenously given. We present a framework for dealing with such situations and find that the cardinality of the set S, which consists of alternatives that every agent ranks strictly, is critical to the construction of a strategyproof social choice function; if |S| ≥ 3, then strategy-proofness implies dictato...
متن کامل